The Complexity of Propositional Linear Temporal Logics in Simple Cases (Extended Abstract)
نویسندگان
چکیده
It is well-known that model-checking and satissability for PLTL are PSPACE-complete. By contrast, very little is known about whether there exist some interesting fragments of PLTL with a lower worst-case complexity. Such results would help understand why PLTL model-checkers are successfully used in practice. In this paper we investigate this issue and consider model-checking and satissability for all fragments of PLTL one obtains when restrictions are put on (1) the temporal connectives allowed, (2) the number of atomic propositions, and (3) the temporal height.
منابع مشابه
The Computational Complexity of Satisfiability of Temporal Horn Formulas in Propositional Linear-Time Temporal Logic
Since the invention of Prolog, a programming language based on classical first-order logic, many people have tried to extend it using similiar ideas and redefine the semantics of the extended Prolog in terms of nonclassical logics [3,5,81. The success of a programming language based on nonclassical logics usually lies in the new definiton of Horn formulas and SLD-resolution-like inference rule....
متن کاملThe Complexity of Dual Models Problem of Propositional Linear Temporal Logics
In this paper, the concept of dual models of a propositional linear temporal logic formula is defined: A formula f has dual models if it has two models (namely two ω-sequences of states) such that the assignments to atomic propositions at each position of them are dual. Then for various propositional linear temporal logics, the complexity of the problem deciding whether a formula f has dual mod...
متن کاملCalendar Logic
A propositional temporal logic is introduced whose operators quantify over intervals of a reference time line. The intervals are specified symbolically, for example ‘next week’s weekend’. The specification language for the intervals takes into account all the features of real calendar systems. A simple statement which can be expressed in this language is for example: ‘yesterday I worked for eig...
متن کاملThe Complexity of Propositional Linear Temporal Logics in Simple Cases
It is well-known that model checking and satisfiability for PLTL are PSPACE-complete. By contrast, very little is known about whether there exist some interesting fragments of PLTL with a lower worst-case complexity. Such results would help understand why PLTL model checkers are successfully used in practice. In this paper we investigate this issue and consider model checking and satisfiability...
متن کاملQuantified CTL : expressiveness and model checking ( Extended abstract ) Arnaud
While it was defined long ago, the extension of CTL with quantification over atomic propositions has never been studied extensively. Considering two different semantics (depending whether propositional quantification refers to the Kripke structure or to its unwinding tree), we study its expressiveness (showing in particular that QCTL coincides with Monadic Second-Order Logic for both semantics)...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1998